Facet browsing currently unavailable
Page 1 of 618 results
Sort by: relevance publication year
Complexity of Computer Computations JOURNAL ARTICLE published April 1974 in Mathematics of Computation |
Wadge Reducibility and Infinite Computations JOURNAL ARTICLE published November 2008 in Mathematics in Computer Science |
Complexity profiles and generic Muchnik reducibility JOURNAL ARTICLE published January 2024 in Advances in Mathematics Research funded by National Science Foundation (1606455,2053848) |
Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers JOURNAL ARTICLE published 1971 in Applications of Mathematics |
On the computational complexity of combinatorial flexibility problems JOURNAL ARTICLE published December 2010 in International Journal of Computer Mathematics |
Some combinatorial-algebraic problems from complexity theory JOURNAL ARTICLE published December 1994 in Discrete Mathematics |
The computational complexity of network problems OTHER published 1982 in The Mathematics of Networks |
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing JOURNAL ARTICLE published November 1966 in SIAM Journal on Applied Mathematics |
The Greater Metropolitan New York Math Fair JOURNAL ARTICLE published November 1972 in Mathematics Magazine |
Complexity and approximation: Combinatorial optimization problems and their approximability properties JOURNAL ARTICLE published July 2000 in Computers & Mathematics with Applications |
Karp-Miller Trees for a Branching Extension of VASS JOURNAL ARTICLE published 1 January 2005 in Discrete Mathematics & Theoretical Computer Science |
The Complexity of Combinatorial Isomorphism Problems BOOK CHAPTER published 1980 in Combinatorics 79 Part I |
Complexity of Morpheme acquisition BOOK CHAPTER published 13 October 1994 in Language Computations |
Linear time transformations between combinatorial problems JOURNAL ARTICLE published January 1982 in International Journal of Computer Mathematics |
Combinatorial flexibility problems and their computational complexity JOURNAL ARTICLE published February 2008 in Electronic Notes in Discrete Mathematics |
Computing near-optimal solutions to combinatorial optimization problems BOOK CHAPTER published 1 June 1995 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science |
The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes JOURNAL ARTICLE published January 2007 in SIAM Journal on Discrete Mathematics |
Book Review: The power of a great introduction. Karp, Alexander, Schubring, Gert (Eds.) (2014). Handbook on the history of mathematics education JOURNAL ARTICLE published June 2016 in Educational Studies in Mathematics |
Boolean decomposition schemes and the complexity of reliability computations BOOK CHAPTER published 25 July 1991 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science |
Distribution of Missing Differences in Diffsets BOOK CHAPTER published 2021 in Springer Proceedings in Mathematics & Statistics |